Performance Evaluation of Dynamic Signature File Methods

With rapid increase of information requirements from various application areas, there has been much research on dynamic information storage structures that effectively support insertions, deletions and updates. In this paper we evaluate the performance of the existing dynamic signature file methods such as the S-tree, Quick Filter and H S file, and provide guidelines for the most effective usage t o a given operational environment. W e derive analytic performance evaluation models of the storage structures based on retrieval t ime, storage overhead and insertion t ime. W e also perform extensive experiments with various data distributions such as uniform, normal and exponential distributions.